Convergence of successive substitution starting procedures
نویسندگان
چکیده
منابع مشابه
Convergence in nite precision of successive
This paper is devoted to the analysis of the behaviour, in nite precision arithmetic, of the simplest linear iterative scheme one can think of, that is the successive iteration method (SI) x 0 ; x k+1 = Ax k + b; k 0 where A is a real or complex matrix of order n and x is a real or complex vector of size n. In exact arithmetic, the behaviour of (1) is completely understood ; there is convergenc...
متن کاملConvergence substitution for paralysed horizontal gaze.
Three patients with paralysed horizontal gaze are presented. Involuntary use of convergence to assist horizontal gaze was noted as a late feature. All patients showed (1) unilateral or bilateral horizontal gaze palsy (two patients had one and a half syndrome, the other had bilateral nuclear sixth nerve palsies), (2) adduction of both eyes on attempted gaze into the paralysed field, (3) miosis w...
متن کاملOn the Convergence of Successive Linear-Quadratic Programming Algorithms
The global convergence properties of a class of penalty methods for nonlinear programming are analyzed. These methods include successive linear programming approaches, and more specifically, the successive linear-quadratic programming approach presented by Byrd, Gould, Nocedal and Waltz (Math. Programming 100(1):27–48, 2004). Every iteration requires the solution of two trust-region subproblems...
متن کاملOn the finite convergence of successive SDP relaxation methods
Let F be a subset of the n-dimensional Euclidean spaceR represented in terms of a compact convex subset C0 and a set PF of nitely or in nitely many quadratic functions on R such that F = fx 2 C0 : p(x) 0 (8p( ) 2 PF )g. In this paper, we investigate some fundamental properties related to the nite convergence of the successive SDP (semide nite programming) relaxation method proposed by the autho...
متن کاملOn the Convergence of Successive Linear Programming Algorithms
We analyze the global convergence properties of a class of penalty methods for nonlinear programming. These methods include successive linear programming approaches, and more specifically the SLP-EQP approach presented in [1]. Every iteration requires the solution of two trust region subproblems involving linear and quadratic models, respectively. The interaction between the trust regions of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1967
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-67-99147-8